Ternary Trees Usage for Computational Experiment Data Storage

Repository for a great number of the suspected function runs must often be organized during the realization of numerical global optimization method or program modules testing methods. In this connection the problem of a fastaccess search of required element arises. A way to solve the problem can be found through the organization of an effective data repository, which allows for rapid implementation of the search and insertion of new elements. The binary and ternary trees storage options are considered in the paper, their comparison is made, recommendations for use of analyzed data models are reported.